Qué (quién) es bipartite graph - definición
Bipartite graph
![A [[complete bipartite graph]] with ''m'' = 5 and ''n'' = 3](https://commons.wikimedia.org/wiki/Special:FilePath/Biclique K 3 5 bicolor.svg?width=200 "A [[complete bipartite graph]] with ''m'' = 5 and ''n'' = 3")
![The [[Heawood graph]] is bipartite.](https://commons.wikimedia.org/wiki/Special:FilePath/Heawood graph bipartite (bicolor).svg?width=200 "The [[Heawood graph]] is bipartite.")
GRAPH OF TWO DISJOINT SETS IN WHICH EVERY VERTEX IN ONE SET IS CONNECTED TO AT LEAST ONE IN THE OTHER
Bipartitie graph; Bipartite Graph; Bipartite graphs; Bipartite plot
In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets U and V, that is every edge connects a vertex in U to one in V. Vertex sets U and V are usually called the parts of the graph.
bipartite graph
GRAPH OF TWO DISJOINT SETS IN WHICH EVERY VERTEX IN ONE SET IS CONNECTED TO AT LEAST ONE IN THE OTHER
Bipartitie graph; Bipartite Graph; Bipartite graphs; Bipartite plot
Convex bipartite graph
In the mathematical field of graph theory, a convex bipartite graph is a bipartite graph with specific properties.
